Decidability of the Membership Problem for 2 × 2 integer matrices
نویسندگان
چکیده
The main result of this paper is the decidability of the membership problem for 2 × 2 nonsingular integer matrices. Namely, we will construct the first algorithm that for any nonsingular 2 × 2 integer matrices M1, . . . ,Mn and M decides whether M belongs to the semigroup generated by {M1, . . . ,Mn}. Our algorithm relies on a translation of numerical problems on matrices into combinatorial problems on words. It also makes use of some algebraic properties of well-known subgroups of GL(2,Z) and various new techniques and constructions that help to convert matrix equations into the emptiness problem for intersection of regular languages.
منابع مشابه
Decidability of the Membership Problem for $2\times 2$ integer matrices
The main result of this paper is the decidability of the membership problem for 2× 2 nonsingular integer matrices. Namely, we will construct the first algorithm that for any nonsingular 2 × 2 integer matrices M1, . . . ,Mn and M decides whether M belongs to the semigroup generated by {M1, . . . ,Mn}. Our algorithm relies on a translation of the numerical problem on matrices into combinatorial p...
متن کاملComplexity of the positive semidefinite matrix completion problem with a rank constraint
We consider the decision problem asking whether a partial rational symmetric matrix with an all-ones diagonal can be completed to a full positive semidefinite matrix of rank at most k. We show that this problem is NP -hard for any fixed integer k ≥ 2. Equivalently, for k ≥ 2, it is NP -hard to test membership in the rank constrained elliptope Ek(G), i.e., the set of all partial matrices with of...
متن کاملVariations of Checking Stack Automata: Obtaining Unexpected Decidability Properties
We introduce a model of one-way language acceptors (a variant of a checking stack automaton) and show the following decidability properties: 1. The deterministic version has a decidable membership problem but has an undecidable emptiness problem. 2. The nondeterministic version has an undecidable membership problem and emptiness problem. There are many models of accepting devices for which ther...
متن کاملMortality for 2×2 Matrices Is NP-Hard
We study the computational complexity of determining whether the zero matrix belongs to a finitely generated semigroup of two dimensional integer matrices (the mortality problem). We show that this problem is NP-hard to decide in the two-dimensional case by using a new encoding and properties of the projective special linear group. The decidability of the mortality problem in two dimensions rem...
متن کاملA ug 2 00 8 On the decidability of semigroup freeness ∗
This paper deals with the decidability of semigroup freeness. More precisely, the freeness problem over a semigroup S is defined as: given a finite subset X ⊆ S, decide whether each element of S has at most one factorization over X. To date, the decidabilities of two freeness problems have been closely examined. In 1953, Sardinas and Patterson proposed a now famous algorithm for the freeness pr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017